Tabu Search Heuristic for Competitive Base Station Location Problem
نویسندگان
چکیده
We consider the following location problem. New 5G networks are deployed by two competitive operators (called resp. O1 and O2), which we refer to as a leader and a follower due to their sequential entering the market. They compete to serve clients by installing and configuring base stations (BS). We assume that the leader had already made a decision and operating a 5G network. Follower arrives at the market knowing the decision of the leader and set it’s own 5G network. Follower is able to set up his BS on all the available cites. It is also possible to share the cite with the leader. In the latter case follower pays leader an additional sharing price. Each client choose the network considering the average quality of the service provided. The aim of the follower is to choose locations for his BS in order to maximize his profit.
منابع مشابه
Solving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method
In this paper, a leader–follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services ar...
متن کاملA Tabu Search Based Solution Approach to the Competitive Multiple Allocation Hub Location Problem
The hub location problems (HLP) constitute an important class of facility location problems that have been addressed by numerous operations researchers in recent years. HLP is a strategic problem frequently encountered in designing logistics and transportation networks. Here, we address the competitive multiple allocation HLP in a duopoly market. It is assumed that an incumbent firm (the leader...
متن کاملCapacitated Single Allocation P-Hub Covering Problem in Multi-modal Network Using Tabu Search
The goals of hub location problems are finding the location of hub facilities and determining the allocation of non-hub nodes to these located hubs. In this work, we discuss the multi-modal single allocation capacitated p-hub covering problem over fully interconnected hub networks. Therefore, we provide a formulation to this end. The purpose of our model is to find the location of hubs and the ...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملCell planning with capacity expansion in mobile communications: a tabu search approach
Cell planning problem with capacity expansion is examined in wireless communications. The problem decides the location and capacity of each new base station to cover expanded and increased traffic demand. The objective is to minimize the cost of new base stations. The coverage by the new and existing base stations is constrained to satisfy a proper portion of traffic demands. The received signa...
متن کامل